A bottom-up polymorphic type inference in logic programming
نویسندگان
چکیده
منابع مشابه
A Bottom-Up Polymorphic Type Inference in Logic Programming
Barbuti, R. and R. Giacobazzi, A bottom-up polymorphjc type inference in logic programming, Science of Computer Programming 19 (1992) 281-313. We present a type inference system for Horn clause logic programs, based on a bottom-up abstract interpretation technique. Through the definition of suitable abstract operators, we obtain an abstract immediate consequence operator map associated with the...
متن کاملBottom-Up Logic Programming for Multicores
In the Claytronics project, we have used Meld, a logic programming language suitable for writing scalable and concise distributed programs for ensembles. Meld allows declarative code to be compiled into distributed code that can be executed in thousands of computing units. We are now using Meld to program more traditional algorithms that run on multicore machines. We made several modifications ...
متن کاملType Inference for Programming Languages: A Constraint Logic Programming Approach
In this paper we present an application of Constraint Logic Programming to the design and implementation of type inference algorithms for programming languages. We present implementations in Prolog and Constraint Handling Rules (CHR) of several algorithms which belong to the state of the art of type inference for programming languages: the Damas-Milner type system, the Ohory system for labeled ...
متن کاملType Inference by Coinductive Logic Programming
We propose a novel approach to constraint-based type inference based on coinductive logic. Constraint generation corresponds to translation into a conjunction of Horn clauses P , and constraint satisfaction is defined in terms of the coinductive Herbrand model of P . We illustrate the approach by formally defining this translation for a small object-oriented language similar to Featherweight Ja...
متن کاملPolymorphic Type Inference in Scheme
This paper presents a type-inference system for Scheme that is designed to be used by students in an introductory programming course. The major goal of the work is to present a simple type inference system that can be used by beginning students, yet is powerful enough to express the ideas of types, polymorphism, abstract data types (ADTs), and higher-order procedures. The system also performs s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1992
ISSN: 0167-6423
DOI: 10.1016/0167-6423(92)90038-d